Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)

This report documents the program and the outcomes of Dagstuhl Seminar 17141 “Probabilistic Methods in the Design and Analysis of Algorithms”. Probabilistic methods play a central role in theoretical computer science. They are a powerful and widely applied tool used, for example, for designing efficient randomized algorithms and for establishing various lower bounds in complexity theory. They also form the basis of frameworks like average-case and smoothed analysis, in which algorithms are analyzed beyond the classical worst-case perspective. The seminar was on probabilistic methods with a focus on the design and analysis of algorithms. The seminar helped to consolidate the research and to foster collaborations among the researchers who use probabilistic methods in different areas of the design and analysis of algorithms. Seminar April 2–7, 2017 – http://www.dagstuhl.de/17141 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.1.6 Optimization, G.2 Discrete Mathematics, G.3 Probability and Statistics